Discovering Highly Informative Feature Sets from Data Streams.

Extraction d%27itemsets distinctifs dans les flux de donn%E9es.

Analysing Satellite Image Time Series by Means of Pattern Mining.

REGLO  une nouvelle strat%E9gie pour r%E9sumer un flux de s%E9ries temporelles.

Analysing Satellite Image Time Series by Means of Pattern Mining.

A fast approximation strategy for summarizing a set of streaming time series.

SAX a privacy preserving general pupose methodapplied to detection of intrusions.

D%E9tection d%27intrusions dans un environnement collaboratif s%E9curis%E9.

Collaborative Outlier Mining for Intrusion Detection.

D%E9tection d%27enregistrements atypiques dans un flot de donn%E9es une approche multi%2Dr%E9solution.%2

D%E9tection d%27enregistrements atypiques dans un flot de donn%E9es une approche multi%2Dr%E9solution.%2

Mining Common Outliers for Intrusion Detection.
Abstract Data mining for intrusion detection can be divided into several sub-topics, among which unsupervised clustering (which has controversial properties). Unsupervised clustering for intrusion detection aims to i) group behaviours together depending on their similarity and ii) detect groups containing only one (or very few) behaviour(s). Such isolated behaviours seem to deviate from the model of normality; therefore, they are considered as malicious. Obviously, not all atypical behaviours are attacks or intrusion attempts. This represents one drawback of intrusion detection methods based on clustering. We take into account the addition of a new feature to isolated behaviours before they are considered malicious. This feature is based on the possible repeated occurrences of the bahaviour on many information systems. Based on this feature, we propose a new outlier mining method which we validate through a set of experiments.
Intrusion Detections in Collaborative Organizations by Preserving Privacy.
Abstract To overcome the problem of attacks on networks, new Intrusion Detection System (IDS) approaches have been proposed in recent years. They consist in identifying signatures of known attacks to compare them to each request and determine whether it is an attack or not. However, these methods are set to default when the attack is unknown from the database of signatures. Usually this problem is solved by calling human expertise to update the database of signatures. However, it is frequent that an attack has already been detected by another organization and it would be useful to be able to benefit from this knowledge to enrich the database of signatures. Unfortunately this information is not so easy to obtain. In fact organizations do not necessarily want to spread the information that they have already faced this type of attack. In this paper we propose a new approach to intrusion detection in a collaborative environment but by preserving the privacy of the collaborative organizations. Our approach works for any signature that may be written as a regular expression insuring that no information is disclosed on the content of the sites.
Data Mining for Intrusion Detection From Outliers to True Intrusions.
Abstract. Data mining for intrusion detection can be divided into several sub-topics, among which unsupervised clustering has controversial properties. Unsupervised clustering for intrusion detection aims to i) group behaviors together depending on their similarity and ii) detect groups containing only one (or very few) behaviour. Such isolated behaviours are then considered as deviating from a model of normality and are therefore considered as malicious. Obviously, all atypical behaviours are not attacks or intrusion attempts. Hence, this is the limits of unsupervised clustering for intrusion detection. In this paper, we consider to add a new feature to such isolated behaviours before they can be considered as malicious. This feature is based on their possible repetition from one information system to another. 1
Parameterless outlier detection in data streams.

A Multi%2Dresolution Approach for Atypical Behaviour Mining.

Parameterless outlier detection in data streams.

A general framework for adaptive and online detection of web attacks.

Efficient mining of sequential patterns with time constraints Reducing the combinations.

Extraction d%92itemsets compacts.

Evolution patterns and gradual trends.

Extraction d%92itemsets compacts.

Des s%E9quences aux tendances.

Time Aware Mining of Itemsets.

Web usage mining extracting unexpected periods from web logs.
Existing Web Usage Mining techniques are currently based on an arbitrary division of the data (e.g. &#034;one log per month&#034;) or guided by presumed results (e.g &#034;what is the customers behaviour for the period of Christmas purchases?&#034;). Those approaches have two main drawbacks. First, they depend on this arbitrary organization of the data. Second, they cannot automatically extract seasons peaks among the stored data. In this paper, we propose to perform a specific data mining process (and particularly to extract frequent behaviours) in order to automatically discover the densest periods. Our method extracts, among the whole set of possible combinations, the frequent sequential patterns related to the extracted periods. A period will be considered as dense if it contains at least one frequent sequential pattern for the set of users connected to the Web site in that period. Our experiments show that the extracted periods are relevant and our approach is able to extract both frequent sequential patterns and the associated dense periods. 
Editorial Introduction to the Special Issue on Multimedia Data Mining.

Peer%2Dto%2DPeer Usage Analysis a Distributed Mining Approach.

Web Usage Mining  extraction de p%E9riodes denses %E0 partir des logs.

Fouille de donn%E9es dans les syst%E8mes Pair%2D%E0%2DPair pour am%E9liorer la recherche de ressources.

Extraction de motifs s%E9quentiels dans les flots de donn%E9es d%27usage du Web.

Une approche centro%EFde pour la classification de s%E9quences dans les data streams.

GWUM  une g%E9n%E9ralisation des pages Web guid%E9e par les usages.

Mining sequential patterns from data streams a centroid approach.

KDD%2FMDM 2006 The 7th KDD Multimedia Data Mining workshop report.

Sequential Pattern Mining for Structure%2DBased XML Document Classification.
Abstract. This article presents an original supervised classification technique for XML documents which is based on structure only. Each XML document is viewed as an ordered labeled tree, represented by his tags only. Our method has three steps. After a cleaning step, we characterize each predefined cluster in terms of frequent structural subsequences. Then we classify the XML documents based on the mined patterns of each cluster. 1
The 6th international workshop on Multimedia Data Mining %28MDM%2FKDD2005%29.

Web Usage Mining Sequential Pattern Extraction with a Very Low Support.
Abstract. The goal of this work is to increase the relevance and the interestingness of patterns discovered by a Web Usage Mining process. Indeed, the sequential patterns extracted on web log files, unless they are found under constraints, often lack interest because of their obvious content. Our goal is to discover minority users ’ behaviors having a coherence which we want to be aware of (like hacking activities on the Web site or a users ’ activity limited to a specific part of the Web site). By means of a clustering method on the extracted sequential patterns, we propose a recursive division of the problem. The developed clustering method is based on patterns summaries and neural networks. Our experiments show that we obtain the targeted patterns whereas their extraction by means of a classical process is impossible because of a very weak support (down to 0.006%). The diversity of users ’ behaviors is so large that the minority ones are both numerous and difficult to locate.
Classer pour d%E9couvrir  une nouvelle m%E9thode d%27analyse du comportement de tous les utilisateurs d%27un site web.


Pre%2DProcessing Time Constraints for Efficiently Mining Generalized Sequential Patterns.


Extraction de motifs s%E9quentiels. Probl%E8mes et m%E9thodes.

Diviser pour D%E9couvrir  une M%E9thode d%27Analyse du Comportement de Tous les Utilisateurs d%27un Site Web.

Incremental mining of sequential patterns in large databases.
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the cost of finding new sequential patterns in the updated database. Our test shows that the algorithm performs significantly faster than the naive approach of mining on the whole updated database from scratch. The difference is so pronounced that this algorithm could also be useful for mining sequential patterns, since in many cases it is faster to apply our algorithm than to mine sequential patterns using a standard algorithm, by breaking down the database into an original database plus an increment. Key words: Sequential patterns, incremental mining, data mining 1
HDM A Client%2FServer%2FEngine Architecture for Real%2DTime Web Usage Mining.

HDM
The Enhanced HDM Specification and Verification System being  developed at SRI International includes an &#034;MLS Checker&#034; that automatically  verifies the security of a certain class of system specifications.
Real Time Web Usage Mining with a Distributed Navigation Analysis.

Web Usage Mining Inter%2DSites Analyse du comportement des utilisateurs %E0 impact imm%E9diat.

A General Architecture for Finding Structural Regularities on the Web.
With the growing popularity of the World Wide Web, the number of semistructured documents  produced in all types of organizations increases at a rapid rate. However the provided information  cannot be queried or manipulated in the general way since, although there is some structure in the  information, it is too irregular to be modeled using a relational or an object-oriented approach.  Nevertheless, some semistructured objects, for the same type of information, have a very similar  structure. Analysis of such regularities can provide very useful information for restructuring a Web  site, for providing a guideline for building indexes and views and in a general way for applying  conventional database technologies which are mainly schema dependent.  In this paper we address the problem of nding such regularities and we propose a general architecture  based on a data mining technique.  1 Introduction  With the growing popularity of the World Wide Web (Web), the number of semistructured ...
Real%2DTime Web Usage Mining A Heuristic Based Distributed Miner.

A General Architecture for Finding Structural Regularities on the Web.
With the growing popularity of the World Wide Web, the number of semistructured documents  produced in all types of organizations increases at a rapid rate. However the provided information  cannot be queried or manipulated in the general way since, although there is some structure in the  information, it is too irregular to be modeled using a relational or an object-oriented approach.  Nevertheless, some semistructured objects, for the same type of information, have a very similar  structure. Analysis of such regularities can provide very useful information for restructuring a Web  site, for providing a guideline for building indexes and views and in a general way for applying  conventional database technologies which are mainly schema dependent.  In this paper we address the problem of nding such regularities and we propose a general architecture  based on a data mining technique.  1 Introduction  With the growing popularity of the World Wide Web (Web), the number of semistructured ...
Incremental Mining of Sequential Patterns in Large Databases.
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the cost of finding new sequential patterns in the updated database. Our test shows that the algorithm performs significantly faster than the naive approach of mining on the whole updated database from scratch. The difference is so pronounced that this algorithm could also be useful for mining sequential patterns, since in many cases it is faster to apply our algorithm than to mine sequential patterns using a standard algorithm, by breaking down the database into an original database plus an increment. Key words: Sequential patterns, incremental mining, data mining 1
Schema Mining Finding Structural Regularity among Semistructured Data.

Web Usage Mining How to Efficiently Manage New Transactions and New Clients.

WebTool An Integrated Framework for Data Mining.
. Large volumes of data such as user address or URL  requested are gathered automatically by Web servers and collected in  access log files. Analysis of server access data can provide significant  and useful information for performance enhancement, and restructuring  a Web site for increased effectiveness. In this paper, we propose an  integrated system (WebTool) for mining user patterns and association  rules from one or more Web servers and pay a particular attention to  handling of time constraints. Once interesting patterns are discovered,  we illustrate how they can be used to customize the server hypertext  organization dynamically.  keywords: data mining, Web usage mining, sequential patterns, time  constraints, association rules.  1 Introduction  With the growing popularity of the World Wide Web (Web), large volumes of data such as address of users or URLs requested are gathered automatically by Web servers and collected in access log files. Analysis of server access data can p...
Webtool un environnement int%E9gr%E9 de data mining.

Extraction efficace de motifs s%E9quentiels  le pr%E9traitement des donn%E9es.

The PSP Approach for Mining Sequential Patterns.
. In this paper, we present an approach, called PSP, for mining  sequential patterns embedded in a database. Close to the problem  of discovering association rules, mining sequential patterns requires handling  time constraints. Originally introduced in [3], the issue is addressed  by the GSP approach [10]. Our proposal resumes the general principles  of GSP but it makes use of a different intermediary data structure which  is proved to be more efficient than in GSP.  1 Introduction  Motivated by decision support problems, data mining, also known as knowledge discovery in databases, has been extensively addressed in the few past years (e.g. [5]). Among takled issues, the problem of mining association rules, initially introduced in [1], has recently received a great deal of attention [1, 2, 4, 5, 9, 11]. The problem of mining association rules is often referred to as the &#034;marketbasket &#034; problem, because purchase transaction data collected by retail stores offers a typical application gr...
